A Variable Neighborhood Search-Based Heuristic for the Multi-Depot Vehicle Routing Problem
نویسندگان
چکیده
منابع مشابه
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows
The aim of this paper is to propose an algorithm based on the philosophy of the Variable Neighborhood Search (VNS) to solve Multi Depot Vehicle Routing Problems with Time Windows. The paper has two main contributions. First, from a technical point of view, it presents the first application of a VNS for this problem and several design issues of VNS algorithms are discussed. Second, from a proble...
متن کاملThe multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation
The multi-depot fleet size and mix vehicle routing problem, also known as the multi-depot routing with heterogeneous vehicles, is investigated. A mathematical formulation is given and lower as well as upper bounds are produced using a three hour execution time of CPLEX. An efficient implementation of variable neighborhood search that incorporates new features in addition to the adaptation of se...
متن کاملAn Improved Variable Neighborhood Search Algorithm for Multi Depot Heterogeneous Vehicle Routing Problem based on Hybrid Operators
This paper presents an Imporved Variable Neighborhood Search (IVNS) algorithm to solve Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows (MDHVRPTW). The initial solution is obtained by customer allocation and path planning based on a cost network. The hybrid operators of insert and exchange are used to achieve the shaking process and the later optimization process is presented...
متن کاملA tabu search heuristic for the multi-depot vehicle routing problem
-This article describes a tabu search algorithm for the multi-depot vehicle routing problem with capacity and route length restrictions. The algorithm is tested on a set of 23 benchmark instances. It is shown to outperform existing heuristics. 1. I N T R O D U C T I O N The purpose of this article is to describe a new heuristic algorithm for the Mult i -Depot Vehicle Routing Problem (MDVRP) def...
متن کاملA hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
This paper presents a new hybrid variable neighborhood-tabu search heuristic for the Vehicle Routing Problem with Multiple Time windows. It also proposes a minimum backward time slack algorithm applicable to a multiple time windows environment. This algorithm records the minimum waiting time and the minimum delay during route generation and adjusts the arrival and departure times backward. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Teknik Industri
سال: 2013
ISSN: 2087-7439,1411-2485
DOI: 10.9744/jti.15.2.95-102